Noncrossing Partitions, Clusters and the Coxeter Plane
نویسنده
چکیده
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how the classical-type constructions of planar diagrams arise uniformly from projections of smallW -orbits to the Coxeter plane. When the construction is applied beyond the classical cases, simple criteria are apparent for noncrossing and for compatibility for W of types H3 and I2(m) and less simple criteria can be found for compatibility in types E6, F4 and H4. Our construction also explains why simple combinatorial models are elusive in the larger exceptional types.
منابع مشابه
Clusters, Noncrossing Partitions and the Coxeter Plane Nathan Reading
The present research is a contribution to W -Catalan combinatorics, which concerns generalizations of objects counted by the Catalan number to an arbitrary finite Coxeter group W. Triangulations of a polygon are a special case of the combinatorial clusters appearing in the theory of cluster algebras of finite type. Planar diagrams analogous to triangulations encode the combinatorics of clusters...
متن کاملClusters, Coxeter-sortable Elements and Noncrossing Partitions
We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in terms of their inversion sets and, in the classical cases, in terms of permutations.
متن کاملNoncrossing partitions and representations of quivers
We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading’s bijection between noncrossing partitions and clusters in this context, and show that it extends to the extended Dynkin case. Our setup also yields a new proof that the noncrossing partitions associated to a finite Coxeter group form a latti...
متن کاملChains in the Noncrossing Partition Lattice
We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification of finite Coxeter groups) using basic facts about noncrossing partitions. We solve these recursions for each finite Coxeter group in the classification. Amon...
متن کاملNoncrossing Partitions for the Group Dn
Abstract. The poset of noncrossing partitions can be naturally defined for any finite Coxeter group W . It is a self-dual, graded lattice which reduces to the classical lattice of noncrossing partitions of {1, 2, . . . , n} defined by Kreweras in 1972 when W is the symmetric group Sn, and to its type B analogue defined by the second author in 1997 when W is the hyperoctahedral group. We give a ...
متن کامل